Generalized Gardiner–Praeger graphs and their symmetries

نویسندگان

چکیده

A subgroup of the automorphism group a graph acts half-arc-transitively on if it transitively vertex-set and edge-set but not arc-set graph. If full half-arc-transitively, is said to be half-arc-transitive. In 1994 Gardiner Praeger introduced two families tetravalent arc-transitive graphs, called C±1 C±ε that play prominent role in characterization graphs admitting an automorphisms with normal elementary abelian such corresponding quotient cycle. All Gardiner–Praeger are admit half-arc-transitive automorphisms. Quite recently, Potočnik Wilson family CPM which generalizations graphs. Most these arc-transitive, some them fact, at least up order 1000, each loosely-attached odd radius having vertex-stabilizers greater than 2 isomorphic this paper we determine investigate isomorphisms between them. Moreover, 2-arc-transitive,

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Generalized Coprime Graphs

Paul Erdos defined the concept of coprime graph and studied about cycles in coprime graphs. In this paper this concept is generalized and a new graph called Generalized coprime graph is introduced. Having observed certain basic properties of the new graph it is proved that the chromatic number and the clique number of some generalized coprime graphs are equal.

متن کامل

Generalized global symmetries and holography

We study the holographic duals of four-dimensional field theories with 1-form global symmetries, both discrete and continuous. Such higher-form global symmetries are associated with antisymmetric tensor gauge fields in the bulk. Various different realizations are possible: we demonstrate that a Maxwell action for the bulk antisymmetric gauge field results in a non-conformal field theory with a ...

متن کامل

Spatzier’s Conjecture and Generalized Symmetries

Within the smooth category, an intertwining is exhibited between the global rigidity of irreducible higher-rank Z Anosov actions on T and the classification of equilibrium-free flows on T that possess nontrivial generalized symmetries.

متن کامل

Symmetries of Graphs and Networks

Symmetric graphs of diameter 2 with complete normal quotients Carmen Amarra University of Western Australia, Australia [email protected] A graph has diameter 2 if it is not a complete graph and if every pair of nonadjacent vertices is joined by a path of length 2. Our general problem is to examine the overall structure of graphs which are both arc-transitive and of diameter 2 using norm...

متن کامل

Decomposing Graphs with Symmetries

While decomposing graphs in simpler items greatly helps to design more efficient algorithms, some classes of graphs can not be handled using the classical techniques. We show here that a graph having enough symmetries can be factored into simpler blocks through a standard morphism and that the inverse process may be formalized as a pullback rewriting system.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2021

ISSN: ['1872-681X', '0012-365X']

DOI: https://doi.org/10.1016/j.disc.2020.112263